m-Consensus Objects Are Pretty Powerful

A recent paper by Afek, Ellen, and Gafni introduced a family of deterministic objects Om,k, for m, k ≥ 2, with consensus numbers m such that, for each k ≥ 2, Om,k is computationally less powerful than Om,k+1 in systems with at least mk+m+k processes. This paper gives a wait-free implementation of Om,k from (m+ 1)-consensus objects and registers in systems with any finite number of processes. In order to do so, it introduces a new family of objects which helps us to understand the power of m-consensus among more than m processes. 1998 ACM Subject Classification E.1 Distributed Data Structures, F.1.2 Parallelism and concurrency